Sharing of Computations

Sharing of Computations

Towards a formal model for sharing and reusing ranking computations

In this paper we present our efforts towards the design of vRank. The “Vocabulary for Ranking” allows to formally materialize ranking data algorithms. We justify the need for such a vocabulary and we show potential applications in the context of Linked Data consumption.

Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields

We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme (LSSS) de ned over a nite eld Fq, with the following properties. 1. It is ideal. The number of players n can be as large as #C(Fq), where C is an algebraic curve C of genus g de ned over Fq. 2. It is quasi-threshold: it is t-r...

Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations

Two of the major branches in secure multi-party computation research are secret sharing and garbled circuits. This work succeeds in combining these to enable seamlessly switching to the technique more efficient for the required functionality. As an example, we add garbled circuits based IEEE 754 floating-point numbers to a secret sharing environment achieving very high efficiency and the first,...

Spi Computations on Grids Computations on Grids Computations on Grids

We study how the underlying graph of dependencies of one dimensional cellular automaton may be used in order to move and compose areas of computations. This allows us to deene complex cellular automata, relaxing in some way the inherent synchronism of such networks. and asynchronous computations. R esum e Nous etudions comment le graphe sous-jacent de d ependances d'un automate cellulaire de di...